Average and randomized communication complexity
نویسندگان
چکیده
منابع مشابه
Average and Randomized Communication Complexity
42 and transmits the index of the set that contains x. By the model assumption he doesn't need to transmit which partition was picked. P Y then, transmits 1 if y belongs to the same set in the partition and 0 otherwise. The number of bits transmitted is 1 + dlog n b1+2(n?1)c e. The error probability is clearly 0 if x = y and, by symmetry or a more cumbersome argument, at most 2 for x 6 = y. As ...
متن کاملAverage and randomized communication complexity
The communication complexity of a two-variable function f (x , y) is the number of information bits two communicators need to exchange to compute f when, initially, each knows only one of the variables. There are several communication-complexity measures corresponding to whether 1) the worst case or average number of bits is considered, 2) computation errors are allowed or not, and 3) randomiza...
متن کاملAverage Circuit Depth and Average Communication Complexity
We use the techniques of Karchmer and Widgerson KW90] to derive strong lower bounds on the expected parallel time to compute boolean functions by circuits. By average time, we mean the time needed on a self-timed circuit, a model introduced recently by Jakoby, Reischuk, and Schindelhauer, JRS94] in which gates compute their output as soon as it is determined (possibly by a subset of the inputs ...
متن کاملAverage and Randomized Complexity of Distributed Problems
A.C. Yao proved that in the decision-tree model the average complexity of the best deterministic algorithm is a lower bound on the complexity of randomized algorithms that solve the same problem. Here it is shown that a similar result does not always hold in the common model of distributed computation, the model in which all the processors run the same program (that may depend on the processors...
متن کاملRandomized Communication Complexity of Approximating Kolmogorov Complexity
The paper [Harry Buhrman, Michal Koucký, Nikolay Vereshchagin. Randomized Individual Communication Complexity. IEEE Conference on Computational Complexity 2008: 321-331] considered communication complexity of the following problem. Alice has a binary string x and Bob a binary string y, both of length n, and they want to compute or approximate Kolmogorov complexity C(x|y) of x conditional to y. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1990
ISSN: 0018-9448
DOI: 10.1109/18.50368